可达标识图
Deciding liveness of bounded Petri nets with its reachable marking graph is easy, but for unbounded Petri nets that are generally existing, finding an algorithm for its liveness decision is not easy.
对有界Petri网,通过构造其可达标识图来判定其活性是容易的,但对于大量的无界Petri网,找到一个判定其活性的一般性算法并不容易。
微语录 · 生活常识
微语录 · 经典语录
微语录 · 句子大全
微语录 · 爱情句子